Adaptive Network Flow with k-Arc Destruction

نویسندگان

  • Thomas Ridremont
  • Dimitri Watel
  • Pierre-Louis Poirion
  • Christophe Picouleau
چکیده

When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with k-Arc Destruction is known to be NP -hard for k = 2. We show that when a flow is allowed to be adaptive the problem becomes polynomial for every fixed k.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The maximum residual flow problem: NP-hardness with two-arc destruction

(V,A, c) be a directed network with node set V , arc set A = {e1, · · · , em}, and capacities on arcs c : A 7→ R+, where R+ is the set of non-negative rational numbers. Let s, t ∈ V be two distinct nodes, designated as the source and the destination. Let P = {p1, · · · , pk} be the set of s-t paths in G. Let aij = 1 if arc ei ∈ A lies on path pj ∈ P and aij = 0 otherwise. Let f : P 7→ R+ be a f...

متن کامل

The use of wavelet-artificial neural network and adaptive neuro-fuzzy inference system models to predict monthly precipitation

In water supply systems, One of the most important components as safety unit and the current controller (Switching flow and regulate the amount of flow) used in the arrangement of lines of water. In this study, according to multiple ponds in Tanguiyeh dam water pipeline to industrial and mining company Gol Gohar Sirjan Butterfly valve used in these ponds using Fluent software simulation has bee...

متن کامل

Adaptive Relay Setting for Flexible AC Transmission Systems (FACTS)

The paper presents an apparent impedance calculation procedure for distance relaying of transmission line involving FACTS devices, particularly the UPFC (unified power flow controller). The presence of UPFC significantly affects the trip boundaries which are also adversely affected by fault resistance combined with remote end infeed. Depending on the UPFC location, the trip boundary is influenc...

متن کامل

Branch-and-Price-and-Cut for Single-Commodity Fixed-Charge Network Flow Problems

We consider the single-commodity single-origin fixed-charge network flow problem (SSFNP) defined on a directed network G = (V,A), where V is the node set and A is the arc set, with each arc a represented by the ordered pair of head and tail nodes (h(a), t(a)). The node set includes a single origin (with no incoming arc), multiple destinations (with no outgoing arc) and transshipment nodes (with...

متن کامل

Modeling of streamflow- suspended sediment load relationship by adaptive neuro-fuzzy and artificial neural network approaches (Case study: Dalaki River, Iran)

Modeling of stream flow–suspended sediment relationship is one of the most studied topics in hydrology due to itsessential application to water resources management. Recently, artificial intelligence has gained much popularity owing toits application in calibrating the nonlinear relationships inherent in the stream flow–suspended sediment relationship. Thisstudy made us of adaptive neuro-fuzzy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1711.00831  شماره 

صفحات  -

تاریخ انتشار 2017